Avalanches in Fractional Cascading
نویسندگان
چکیده
This paper studies the distribution of avalanches in fractional cascading, linking the behavior to studies on self-organized criticality, in particular, the power law behavior of the Bak-Tang-Wiesenfeld sandpile model. Unlike the sandpile model, however, we prove that fractional cascading does not exhibit abelian properties. While fractional cascading has maximum gap size as a system parameter that can be used to tune the system behavior, it does not need very fine tuning for the system to display behavior characteristic of self-organized criticality.
منابع مشابه
Instability of scale-free networks under node-breaking avalanches
– The instability introduced in a large scale-free network by the triggering of nodebreaking avalanches is analyzed using the fiber-bundle model as conceptual framework. We found, by measuring the size of the giant component, the avalanche size distribution and other quantities, the existence of an abrupt transition. This test of strength for complex networks like Internet is more stringent tha...
متن کاملAn implementation of range trees with fractional cascading in C++
Range trees are multidimensional binary trees which are used to perform d-dimensional orthogonal range searching. In this technical report we study the implementation issues of range trees with fractional cascading, named layered range trees. We also document our implementation of range trees with fractional cascading in C++ using STL and generic programming techniques.
متن کاملStatistical properties of avalanches in networks.
We characterize the distributions of size and duration of avalanches propagating in complex networks. By an avalanche we mean the sequence of events initiated by the externally stimulated excitation of a network node, which may, with some probability, then stimulate subsequent excitations of the nodes to which it is connected, resulting in a cascade of excitations. This type of process is relev...
متن کاملDiscrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
This paper studies a discrepancy-sensitive approach to dynamic fractional cascading. We provide an efficient data structure for dominated maxima searching in a dynamic set of points in the plane, which in turn leads to an efficient dynamic data structure that can answer queries for nearest neighbors using any Minkowski metric.
متن کاملEfficiency Analysis of Scale-free Network Cascading Failures under Different Types of Attacks
Network cascading failure can result in a congestion regime with degradation in the network performance. When cascading failure occurring, the netwok traffic will be rerouted to bypass malfunctioning routers, eventually leading to an avalanche of overloads on other routers that are not equipped to handle extra traffic, which Lots of failure models have been constructed to investigate how a smal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012